Self-Stabilizing Group Mutual Exclusion for Asynchronous Rings
نویسندگان
چکیده
منابع مشابه
Improving the Probabilistic Three-State Self Stabilizing Ring
An improvement on the three-state probabilistic self-stabilizing ring proposed in Her92] is presented. The new ring does not suuer from the drawback of token propagation delay problem of the original system. 1 Motivation A self stabilizing distributed system is a network of state machines which, regardless of its initial global state, once started will regain its consistency by itself in a nite...
متن کاملAlmost Two State Self Stabilizing Synchronous Ring
A self stabilizing distributed system is a network of state machines which, regardless of its initial global state, once started will regain its consistency by itself in a nite number of steps. Two are the main issues in the design of a self-stabilizing system: stabilization time and memory requirements. In this paper we present an almost two state self stabilizing unidirectional system solving...
متن کاملOptimal Self-stabilizing Mutual Exclusion on Synchronous Rings
We propose several self-stabilizing protocols for unidirectional, anonymous, and uniform synchronous rings of arbitrary size, where processors communicate by exchanging messages. When the size of the ring n is unknown, we better the service time by a factor of n (performing the best possible complexity for the stabilization time and the memory consumption). When the memory size is known, we pre...
متن کاملSelf-stabilizing K-out-of-L exclusion on tree network
In this paper, we address the problem of k-out-of-l exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...
متن کاملSelf-Stabilizing k-out-of-l exclusion on tree networks
In this paper, we address the problem of k-out-of-l Exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l Exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000